0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.13	% Command    : run_E %s %d THM
0.13/0.35	% Computer : n027.cluster.edu
0.13/0.35	% Model    : x86_64 x86_64
0.13/0.35	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.35	% Memory   : 8042.1875MB
0.13/0.35	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit   : 960
0.13/0.35	% WCLimit    : 120
0.13/0.35	% DateTime   : Tue Aug  9 04:37:36 EDT 2022
0.13/0.35	% CPUTime    : 
0.20/0.48	Running higher-order on 8 cores theorem proving
0.20/0.48	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.20/0.48	# Version: 3.0pre003-ho
0.20/0.48	# Preprocessing class: HSSSSMSSSSSNSSA.
0.20/0.48	# Scheduled 8 strats onto 8 cores with 120 seconds (960 total)
0.20/0.48	# Starting post_as_ho12 with 120s (1) cores
0.20/0.48	# Starting new_bool_9 with 120s (1) cores
0.20/0.48	# Starting post_as_ho1 with 120s (1) cores
0.20/0.48	# Starting post_as_ho4 with 120s (1) cores
0.20/0.48	# Starting post_as_ho2 with 120s (1) cores
0.20/0.48	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.20/0.48	# Starting full_lambda_10 with 120s (1) cores
0.20/0.48	# Starting new_ho_8 with 120s (1) cores
0.20/0.48	# post_as_ho1 with pid 26793 completed with status 0
0.20/0.48	# Result found by post_as_ho1
0.20/0.48	# Preprocessing class: HSSSSMSSSSSNSSA.
0.20/0.48	# Scheduled 8 strats onto 8 cores with 120 seconds (960 total)
0.20/0.48	# Starting post_as_ho12 with 120s (1) cores
0.20/0.48	# Starting new_bool_9 with 120s (1) cores
0.20/0.48	# Starting post_as_ho1 with 120s (1) cores
0.20/0.48	# No SInE strategy applied
0.20/0.48	# Search class: HHUPF-FFSF00-SSSFFFNN
0.20/0.48	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.20/0.48	# Starting new_ho_10 with 65s (1) cores
0.20/0.48	# new_ho_10 with pid 26801 completed with status 0
0.20/0.48	# Result found by new_ho_10
0.20/0.48	# Preprocessing class: HSSSSMSSSSSNSSA.
0.20/0.48	# Scheduled 8 strats onto 8 cores with 120 seconds (960 total)
0.20/0.48	# Starting post_as_ho12 with 120s (1) cores
0.20/0.48	# Starting new_bool_9 with 120s (1) cores
0.20/0.48	# Starting post_as_ho1 with 120s (1) cores
0.20/0.48	# No SInE strategy applied
0.20/0.48	# Search class: HHUPF-FFSF00-SSSFFFNN
0.20/0.48	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.20/0.48	# Starting new_ho_10 with 65s (1) cores
0.20/0.48	# Preprocessing time       : 0.001 s
0.20/0.48	# Presaturation interreduction done
0.20/0.48	
0.20/0.48	# Proof found!
0.20/0.48	# SZS status Theorem
0.20/0.48	# SZS output start CNFRefutation
0.20/0.48	thf(decl_22, type, esk1_0: $i > $i).
0.20/0.48	thf(decl_23, type, esk2_0: $i > $i).
0.20/0.48	thf(decl_24, type, esk3_0: $i).
0.20/0.48	thf(cTHM141_pme, conjecture, ![X1:$i > $i]:((?[X2:$i > $i]:((?[X3:$i]:((((X2 @ X3)=(X3))&![X4:$i]:((((X4)=(X3))<=((X2 @ X4)=(X4))))))&((^[X3:$i]:(X1 @ (X2 @ X3)))=(^[X3:$i]:(X2 @ (X1 @ X3))))))=>?[X5:$i]:(((X1 @ X5)=(X5))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cTHM141_pme)).
0.20/0.48	thf(c_0_1, negated_conjecture, ~(![X1:$i > $i]:((?[X2:$i > $i]:((?[X3:$i]:((((X2 @ X3)=(X3))&![X4:$i]:((((X2 @ X4)=(X4))=>((X4)=(X3))))))&![X11:$i]:(((X1 @ (X2 @ X11))=(X2 @ (X1 @ X11))))))=>?[X5:$i]:(((X1 @ X5)=(X5)))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM141_pme])])])])).
0.20/0.48	thf(c_0_2, negated_conjecture, ![X15:$i, X16:$i, X17:$i]:((((((esk2_0 @ esk3_0)=(esk3_0))&(((esk2_0 @ X15)!=(X15))|((X15)=(esk3_0))))&((esk1_0 @ (esk2_0 @ X16))=(esk2_0 @ (esk1_0 @ X16))))&((esk1_0 @ X17)!=(X17)))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])).
0.20/0.48	thf(c_0_3, negated_conjecture, ![X3:$i]:(((esk1_0 @ (esk2_0 @ X3))=(esk2_0 @ (esk1_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.48	thf(c_0_4, negated_conjecture, ((esk2_0 @ esk3_0)=(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.48	thf(c_0_5, negated_conjecture, ![X3:$i]:((((X3)=(esk3_0))|((esk2_0 @ X3)!=(X3)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.48	thf(c_0_6, negated_conjecture, ((esk2_0 @ (esk1_0 @ esk3_0))=(esk1_0 @ esk3_0)), inference(spm,[status(thm)],[c_0_3, c_0_4])).
0.20/0.48	thf(c_0_7, negated_conjecture, ![X3:$i]:(((esk1_0 @ X3)!=(X3))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.48	thf(c_0_8, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_6]), c_0_7]), ['proof']).
0.20/0.48	# SZS output end CNFRefutation
0.20/0.48	# Parsed axioms                        : 1
0.20/0.48	# Removed by relevancy pruning/SinE    : 0
0.20/0.48	# Initial clauses                      : 4
0.20/0.48	# Removed in clause preprocessing      : 0
0.20/0.48	# Initial clauses in saturation        : 4
0.20/0.48	# Processed clauses                    : 10
0.20/0.48	# ...of these trivial                  : 0
0.20/0.48	# ...subsumed                          : 0
0.20/0.48	# ...remaining for further processing  : 10
0.20/0.48	# Other redundant clauses eliminated   : 0
0.20/0.48	# Clauses deleted for lack of memory   : 0
0.20/0.48	# Backward-subsumed                    : 0
0.20/0.48	# Backward-rewritten                   : 0
0.20/0.48	# Generated clauses                    : 6
0.20/0.48	# ...of the previous two non-redundant : 3
0.20/0.48	# ...aggressively subsumed             : 0
0.20/0.48	# Contextual simplify-reflections      : 0
0.20/0.48	# Paramodulations                      : 6
0.20/0.48	# Factorizations                       : 0
0.20/0.48	# NegExts                              : 0
0.20/0.48	# Equation resolutions                 : 0
0.20/0.48	# Propositional unsat checks           : 0
0.20/0.48	#    Propositional check models        : 0
0.20/0.48	#    Propositional check unsatisfiable : 0
0.20/0.48	#    Propositional clauses             : 0
0.20/0.48	#    Propositional clauses after purity: 0
0.20/0.48	#    Propositional unsat core size     : 0
0.20/0.48	#    Propositional preprocessing time  : 0.000
0.20/0.48	#    Propositional encoding time       : 0.000
0.20/0.48	#    Propositional solver time         : 0.000
0.20/0.48	#    Success case prop preproc time    : 0.000
0.20/0.48	#    Success case prop encoding time   : 0.000
0.20/0.48	#    Success case prop solver time     : 0.000
0.20/0.48	# Current number of processed clauses  : 6
0.20/0.48	#    Positive orientable unit clauses  : 3
0.20/0.48	#    Positive unorientable unit clauses: 0
0.20/0.48	#    Negative unit clauses             : 2
0.20/0.48	#    Non-unit-clauses                  : 1
0.20/0.48	# Current number of unprocessed clauses: 1
0.20/0.48	# ...number of literals in the above   : 1
0.20/0.48	# Current number of archived formulas  : 0
0.20/0.48	# Current number of archived clauses   : 4
0.20/0.48	# Clause-clause subsumption calls (NU) : 0
0.20/0.48	# Rec. Clause-clause subsumption calls : 0
0.20/0.48	# Non-unit clause-clause subsumptions  : 0
0.20/0.48	# Unit Clause-clause subsumption calls : 0
0.20/0.48	# Rewrite failures with RHS unbound    : 0
0.20/0.48	# BW rewrite match attempts            : 0
0.20/0.48	# BW rewrite match successes           : 0
0.20/0.48	# Condensation attempts                : 10
0.20/0.48	# Condensation successes               : 0
0.20/0.48	# Termbank termtop insertions          : 370
0.20/0.48	
0.20/0.48	# -------------------------------------------------
0.20/0.48	# User time                : 0.000 s
0.20/0.48	# System time              : 0.004 s
0.20/0.48	# Total time               : 0.004 s
0.20/0.48	# Maximum resident set size: 1776 pages
0.20/0.48	
0.20/0.48	# -------------------------------------------------
0.20/0.48	# User time                : 0.002 s
0.20/0.48	# System time              : 0.005 s
0.20/0.48	# Total time               : 0.007 s
0.20/0.48	# Maximum resident set size: 1704 pages
0.20/0.48	EOF
